edge path

См. также в других словарях:

• Edge contraction — In graph theory, an edge contraction is an operation which removes an edge from a graph while simultaneously merging together the two vertices it previously connected. Edge contraction is a fundamental operation in the theory of graph minors.… …   Wikipedia

• Edge disjoint shortest pair algorithm — is an algorithm in computer network routing for generating the shortest pair of edge disjoint paths between a given pair of vertices as follows:* Run the shortest pair algorithm for the given pair of vertices * Replace each edge of the shortest… …   Wikipedia

• Edge detection — is a terminology in image processing and computer vision, particularly in the areas of feature detection and feature extraction, to refer to algorithms which aim at identifying points in a digital image at which the image brightness changes… …   Wikipedia

• Path — PathPath may also refer to:*Course (navigation), the intended path of a vehicle over the surface of the Earth *Trail, footpath, or bicycle way in rural or urban settings *Sidewalk running along the edge of a road, in some varieties of English… …   Wikipedia

• Path 66 — (also called the California Oregon Intertie or abbreviated COI) is the name of several 500 kV power lines that were built by Western Area Power Administration (WAPA), Pacific Gas Electric (PG E), and PacifiCorp in the early 1970s to 1990s and… …   Wikipedia

• Edge-notched card — used as a library card. Edges not notched here. A notched card …   Wikipedia

• Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… …   Wikipedia

• Edge-graceful labeling — In graph theory, an edge graceful graph labeling is a type of graph labeling. This is a labeling for simple graphs , namely ones in which no two distinct edges connect the same two distinct vertices, no edge connects a vertex to itself, and the… …   Wikipedia

• Path (graph theory) — In graph theory, a path in a graph is a sequence of vertices such that from each of its vertices there is an edge to the next vertex in the sequence. The first vertex is called the start vertex and the last vertex is called the end vertex . Both… …   Wikipedia

• Edge recombination operator — General DescriptionThe edge recombination operator (ERO) is an operator that creates a path that is similar to a set of existing paths (parents) by looking at the edges rather than the vertices. The main application of this is for crossover in… …   Wikipedia

• Path coloring — In graph theory, path coloring usually refers to one of two problems: * The problem of coloring a (multi)set of paths R in graph G, in such a way that any two paths of R which share an edge in G receive different colors. Set R and graph G are… …   Wikipedia